Coverability and Inhibitor Arcs: an example
نویسندگان
چکیده
Inhibitor arcs pose a problem for the standard Coverability Tree Construction for Place/Transition Nets. A straightforward modification of the construction circumventing this problem works for PT-nets with one inhibitor place. Here it is shown that this modified construction may not terminate in case of two or more inhibitor places. © 2011 Newcastle University. Printed and published by Newcastle University, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details VAN DER VLUGT, S., KLEIJN, J., KOUTNY, M. Coverability and Inhibitor Arcs: an example [By] S. van der Vlugt, J. Kleijn, M. Koutny Newcastle upon Tyne: Newcastle University: Computing Science, 2011. (Newcastle University, Computing Science, Technical Report Series, No. CS-TR-1293)
منابع مشابه
Steps and Coverability in Inhibitor Nets
For Petri nets with inhibitor arcs, properties like reachability and boundedness are undecidable and hence constructing a coverability tree is not feasible. Here it is investigated to what extent the coverability tree construction might be adapted for Petri nets with inhibitor arcs. Emphasis is given to the (a priori) step sequence semantics which cannot always be simulated by firing sequences....
متن کاملOn Petri Nets with Hierarchical Special Arcs
We investigate the decidability of termination, reachability, coverability and deadlock-freeness of Petri nets endowed with a hierarchy on places, and with inhibitor arcs, reset arcs and transfer arcs that respect this hierarchy. We also investigate what happens when we have a mix of these special arcs, some of which respect the hierarchy, while others do not. We settle the decidability status ...
متن کاملAnalyzing Asynchronous Programs with Preemption
Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to be processed later. The model is a pushdown system supplied with a multiset of pending tasks. Tasks may be added to the multiset at each transition, whereas a task is taken from the multiset only when the stack is empty. In thi...
متن کاملReset nets between decidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separat...
متن کاملω-Petri Nets: Algorithms and Complexity
We introduce ω-Petri nets (ωPN), an extension of plain Petri nets with ω-labeled input and output arcs, that is well-suited to analyse parametric concurrent systems with dynamic thread creation. Most techniques (such as the Karp and Miller tree or the Rackoff technique) that have been proposed in the setting of plain Petri nets do not apply directly to ωPN because ωPN define transition systems ...
متن کامل